CPL: An Evidence-Based 5-Dimensional Logic for the Compositional Specification and Verification of Cryptographic Protocols Part I: Language, Process Model, Satisfaction

نویسنده

  • Simon Kramer
چکیده

We (1) define a logic1, called CPL (for Cryptographic Protocol Logic), where truth is established on the grounds of evidence-based knowledge (as opposed to awarenessbased belief), spanning the dimensions2 of first-order, temporal, epistemic, deontic, and linear logic; (2) state a few of its key properties; and (3) illustrate how it can be used to compositionally specify and verify cryptographic protocols designed to establish trust in the security of communication (as opposed to security of storage) between protocolcompliant participants in a hostile environment. Our claim hereby is to give (1) the first formalisation of cryptographic discourse within the framework of multi-dimensional logic, (2) the most comprehensive, logically connected formal model of cryptographic protocols proposed so far, and (3) a rigourous clarification of the concepts constituting the common knowledge of the community of protocol designers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculus of Cryptographic Communication

We define C, a model-based formalism that is one half of a whole framework for the modelling, specification, and verification of cryptographic protocols. C consists of a language of distributed processes and an associated (SOS) notion of concurrent execution. The other, co-designed, half of our framework is a property-based formalism, i.e., a logic, for the specification and verification of suc...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

Extending CAPSL for Logic-Based Verifications

Cryptographic protocols are designed to provide security services, such as key distribution, authentication and non-repudiation, over insecure networks. The design process of cryptographic protocols is highly complex. In particular, the translation from the informal protocol description to the formal protocol specification is an error-prone step, as the exact meaning of the requirements of the ...

متن کامل

Research Plan Logical Foundations of Cryptography

Our Ph.D. [8] has been about a breadth-first exploration of logical concepts in cryptography and their linguistic abstraction and model-theoretic combination in a comprehensive logical system, called CPL (for Cryptographic Protocol Logic). We have focused on two fundamental aspects of cryptography. Namely, the security of communication (as opposed to security of storage) and cryptographic proto...

متن کامل

Web Service Choreography Verification Using Z Formal Specification

Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004